Model Checking Robustness to Desynchronization

The engineering of an everyday broader spectrum of systems requires reasoning on a combination of synchronous and asynchronous interaction, ranging from co-designed hardware-software architectures, multi-threaded reactive systems to distributed telecommunication applications. Stepping from the synchronous specification of a system to its distributed implementation requires to address the crucial issue of desynchronization: how to preserve the meaning of the synchronous design on a distributed architecture ? We study this issue by considering a simple S s-like calculus of synchronous processes. In this context, we formulate the properties of determinism and of robustness to desynchronization. To check a specification robust to desynchronization, we consider a canonical representation of synchronous processes that makes control explicit. We show that the satisfaction of the property of determinism and of robustness to desynchronization amounts to a satisfaction problem which consists of hierarchically checking boolean formula.